Normalizing the Taylor expansion of non-deterministic {\lambda}-terms, via parallel reduction of resource vectors
نویسنده
چکیده
It has been known since Ehrhard and Regnier’s seminal work on the Taylor expansion of λ-terms that this operation commutes with normalization: the expansion of a λ-term is always normalizable and its normal form is the expansion of the Böhm tree of the term. We generalize this result to the non-uniform setting of the algebraic λ-calculus, i.e., λ-calculus extended with linear combinations of terms. This requires us to tackle two difficulties: foremost is the fact that Ehrhard and Regnier’s techniques rely heavily on the uniform, deterministic nature of the ordinary λ-calculus, and thus cannot be adapted; second is the absence of any satisfactory generic extension of the notion of Böhm tree in presence of quantitative non-determinism, which is reflected by the fact that the Taylor expansion of an algebraic λ-term is not always normalizable. Our solution is to provide a fine grained study of the dynamics of β-reduction under Taylor expansion, by introducing a notion of reduction on resource vectors, i.e. infinite linear combinations of resource λ-terms. The latter form the multilinear fragment of the differential λ-calculus, and resource vectors are the target of the Taylor expansion of λterms. We show the reduction of resource vectors contains the image of any β-reduction step, from which we deduce that Taylor expansion and normalization commute on the nose. We moreover identify a class of algebraic λ-terms, encompassing both normalizable algebraic λ-terms and arbitrary ordinary λ-terms: the expansion of these is always normalizable, which guides the definition of a generalization of Böhm trees to this setting.
منابع مشابه
Strong Normalizability as a Finiteness Structure via the Taylor Expansion of \lambda λ -terms
In the folklore of linear logic, a common intuition is that the structure of finiteness spaces, introduced by Ehrhard, semantically reflects the strong normalization property of cut-elimination. We make this intuition formal in the context of the non-deterministic λ-calculus by introducing a finiteness structure on resource terms, which is such that a λ-term is strongly normalizing iff the supp...
متن کاملStrong Normalizability as a Finiteness Structure
In the folklore of linear logic, a common intuition is that the structure of finiteness spaces, introduced by Ehrhard, semantically reflects the strong normalization property of cut-elimination. We make this intuition formal in the context of the non-deterministic λ-calculus by introducing a finiteness structure on resource terms, which is such that a λ-term is strongly normalizing iff the supp...
متن کاملTaylor Expansion, β-Reduction and Normalization
We introduce a notion of reduction on resource vectors, i.e. infinite linear combinations of resource λ-terms. The latter form the multilinear fragment of the differential λ-calculus introduced by Ehrhard and Regnier, and resource vectors are the target of the Taylor expansion of λ-terms. We show that the reduction of resource vectors contains the image, through Taylor expansion, of β-reduction...
متن کاملBöhm's Theorem for Resource Lambda Calculus through Taylor Expansion
We study the resource calculus, an extension of the λ-calculus allowing to model resource consumption. We achieve an internal separation result, in analogy with Böhm’s theorem of λ-calculus. We define an equivalence relation on the terms, which we prove to be the maximal non-trivial congruence on normalizable terms respecting β-reduction. It is significant that this equivalence extends the usua...
متن کاملBöhm trees, Krivine machine and the Taylor expansion of ordinary lambda-terms
We show that, given an ordinary lambda-term and a normal resource lambda-term which appears in the normal form of its Taylor expansion, the unique resource term of the Taylor expansion of the ordinary lambda-term reducing to this normal resource term can be obtained by running a version of the Krivine abstract machine.
متن کامل